Transfinite Braids and Left Distributive Operations
نویسنده
چکیده
We complete Artin’s braid group B∞ with some limit points (with respect to a natural topology), thus obtaining an extended monoid where new left self-distributive operations are defined. This construction provides an effective realization for some free algebraic system involving a left distributive operation and a compatible associative product. AMS Subject classification: 20F36, 20N02 Here we investigate a rather natural extension of the usual notion of a braid, namely that obtained by considering two infinite series of strands rather than just one as in the case of Artin’s braid group B∞. The corresponding group is very large, but it turns out that a certain submonoid EB∞ of this group can be described very simply as a completion of B∞. This completion is obtained by adding upper bounds to some sequences that are increasing for a canonical linear ordering, or, equivalently, that are Cauchy sequences with respect to the associated topology. The basic study of the monoid EB∞ is the content of the first two sections. The sequel of the paper is devoted to the study of left self-distributive operations on the monoid EB∞, i.e., of binary operations ∗ that satisfy the algebraic identity x ∗ (y ∗ z) = (x ∗ y) ∗ (x ∗ z). (LD) There is nothing gratuitous in this task. Indeed it is well known that deep connections exist between braids (and knots) and self-distributive structures [2], [15], [16], [17], [9] — as well as between the latter and set theory [5], [20], [21], [13] (see also [3] for another relation between braid groups and distributivity). In particular we recall in Section 2 that each new example of an LD-system (defined as a set equipped with a left self-distributive operation) can potentially bring new information about braids using the formalism of braid colourings. So constructing “concrete” LD-systems is a natural aim. It is both easy and difficult. It is easy, since there are very common examples, like lattices, or groups equipped with the conjugacy operation x ∗ y = xyx−1. But these examples
منابع مشابه
Strange Questions about Braids
The infinite braid group B∞ admits a left self-distributive structure. In particular, it includes a free monogenerated left self-distributive system, and, therefore, it inherits all properties of the latter object. Here we discuss how such algebraic properties translate into the language of braids. We state new results about braids and propose a list of open questions.
متن کاملDeux Propriétés Des Groupes De Tresses. Two Properties of Braid Groups
We describe a new algorithm for comparing braid words, and establish some order properties for the braid groups which are connected with left distributive operations. Abridged English Version. We apply to braids some tools used in the study of left distributive operations (c.f. [2]). The results deal with special decompositions of braid words. One describes a new quadratic algorithm for compari...
متن کاملConstruction of Self-Distributive Operations and Charged Braids
Starting from a certain monoid that describes the geometry of the left self-distributivity identity, we construct an explicit realization of the free left self-distributive system on any number of generators. This realization lives in the charged braid group, an extension of Artin’s braid group B∞ with a simple geometrical interpretation. AMS Classification: 20N02, 20F36, 08B20. Constructing ex...
متن کاملImplications, coimplications and left semi-uninorms on a complete lattice
In this paper, we firstly show that the $N$-dual operation of the right residual implication, which is induced by a left-conjunctive right arbitrary $vee$-distributive left semi-uninorm, is the right residual coimplication induced by its $N$-dual operation. As a dual result, the $N$-dual operation of the right residual coimplication, which is induced by a left-disjunctive right arbitrary $wedge...
متن کاملA Practical Attack on a Certain Braid Group Based Shifted Conjugacy Authentication Protocol
In recent years, Artin’s braid groups have undergone intense scrutiny as a possible cryptographic platform, due mainly to the key-exchange protocols proposed in [1] and [12]. The security of both of these protocols relies on the difficulty of variants of the conjugacy search problem in braid groups, a well-studied problem (see [9], [6], [10]). More recently, Dehornoy has proposed a zero-knowled...
متن کامل